Graphs Capturing Alternations in Words
نویسندگان
چکیده
A graph G = (V,E) is representable if there exists a word W over the alphabet V such that letters x and y alternate in W if and only if (x, y) ∈ E for each x 6= y. If W is k-uniform (each letter of W occurs exactly k times in it) then G is called k-representable. A graph is representable if and only if it is k-representable for some k [1]. In this note, we introduce the applicability of representable graphs, and answer several open questions from [1].
منابع مشابه
Developing biases
German nouns may alternate from singular to plural in two different ways. Some singular forms that end in a voiceless obstruent have a plural in which this obstruent is voiced. Another alternation concerns the vowel. Some singular forms with a back vowel have a plural form in which this back vowel is front. For each noun it has to be established individually whether it alternates or not. The vo...
متن کاملRegular polysemy: A distributional model
Many types of polysemy are not word specific, but are instances of general sense alternations such as ANIMAL-FOOD. Despite their pervasiveness, regular alternations have been mostly ignored in empirical computational semantics. This paper presents (a) a general framework which grounds sense alternations in corpus data, generalizes them above individual words, and allows the prediction of altern...
متن کاملUnderlying Representations and Bantu Segmental Phonology
For decades the assumption in traditional phonology has been that URs had the two functions of (i) capturing generalizations (“what’s in the language”) and (ii) capturing the speaker’s knowledge (“what’s in the head”). Bantu languages have been among those providing evidence of robust morphophonemic alternations of the sort captured by URs in generative phonology. In this paper I take a new loo...
متن کاملGeneralized Data Automata and Fixpoint Logic
Data ω-words are ω-words where each position is additionally labelled by a data value from an infinite alphabet. They can be seen as graphs equipped with two sorts of edges: ‘next position’ and ‘next position with the same data value’. Based on this view, an extension of Data Automata called Generalized Data Automata (GDA) is introduced. While the decidability of emptiness of GDA is open, the d...
متن کاملL1 Phonotactic Knowledge and the L2 Acquisition of Alternations
Phonological alternations often serve to modify forms so that they respect a phonotactic restriction that applies across the words of language. Although it has long been assumed that an adequate theory of phonology should capture the connection between phonotactics and alternations, there is however, no psycholinguistic evidence that speakers actually do use a single mechanism for them both. In...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010